منابع مشابه
Reproducing kernel method for singular multi-point boundary value problems
Purpose: In this paper, we shall present an algorithm for solving more general singular second-order multi-point boundary value problems. Methods: The algorithm is based on the quasilinearization technique and the reproducing kernel method for linear multi-point boundary value problems. Results: Three numerical examples are given to demonstrate the efficiency of the present method. Conclusions:...
متن کاملApplication of Tau Approach for Solving Integro-Differential Equations with a Weakly Singular Kernel
In this work, the convection-diffusion integro-differential equation with a weakly singular kernel is discussed. The Legendre spectral tau method is introduced for finding the unknown function. The proposed method is based on expanding the approximate solution as the elements of a shifted Legendre polynomials. We reduce the problem to a set of algebraic equations by using operational matrices....
متن کاملReproducing kernel method for singular fourth order four-point boundary value problems
This paper investigates the analytical approximate solutions of singular fourth order four-point boundary value problems using reproducing kernel method (RKM). The solution obtained by using the method takes the form of a convergent series with easily computable components. However, the reproducing kernel method can not be used directly to solve singular fourth order four-point boundary value p...
متن کاملSolving singular second-orderinitial/boundary value problems in reproducing kernel Hilbert space
In this paper, we presents a reproducing kernel method for computing singular second-order initial/boundary value problems (IBVPs). This method could deal with much more general IBVPs than the ones could do, which are given by the previous researchers. According to our work, in the first step, the analytical solution of IBVPs is represented in the RKHS which we constructs. Then, the analytic ap...
متن کاملOn Some Hard Problems on Matroid Spikes
Spikes form an interesting class of 3-connected matroids of branch-width 3. We show that some computational problems are hard on spikes with given matrix representations over infinite fields. Namely, the question whether a given spike is the free spike is co-NP -hard (though the property itself is definable in monadic second-order logic); and the task to compute the Tutte polynomial of a spike ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications in Partial Differential Equations
سال: 2003
ISSN: 0360-5302,1532-4133
DOI: 10.1081/pde-120020485